Securely Solving Simple Combinatorial Graph Problems
نویسندگان
چکیده
We investigate the problem of solving traditional combinatorial graph problems using secure multi-party computation techniques, focusing on the shortest path and the maximum flow problems. To the best of our knowledge, this is the first time these problems have been addressed in a general multi-party computation setting. Our study highlights several complexity gaps and suggests the exploration of various trade-offs, while also offering protocols that are efficient enough to solve real-world problems.
منابع مشابه
Securely Solving the Distributed Graph Coloring Problem
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve the problem. However, this requires all...
متن کاملAn algorithm applicable to clearing combinatorial exchanges
It is important to approach negotiations in a way that ensures privacy. So far, research has focused on securely solving restricted classes of negotiation techniques, mainly the (M+1)-st-price auctions. Here we show how these results can be adapted to more general problems. This paper extends our previous results on how distributed finite discrete problems can be solved securely. Such problems ...
متن کاملSolving Combinatorial Optimization Problems using Distributed Approach
Combinatorial optimization is a way of finding an optimum solution from a finite set of objects. For combinatorial optimization problems, the number of possible solutions grows exponentially with the number of objects. These problems belong to the class of NP hard problems for which probably efficient algorithm does not exist. Using the distributed approach with parallelization these problems c...
متن کاملSolving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT
Stochastic local search is an effective technique for solving certain classes of large, hard propositional satisfiability problems, including propositional encodings of problems such as circuit synthesis and graph coloring (Selman, Levesque, and Mitchell 1992; Selman, Kautz, and Cohen 1994). Many problems of interest to AI and operations research cannot be conveniently encoded as simple satisfi...
متن کاملThesis for the degree Doctor of Philosophy
The Multiscale method is a class of algorithmic techniques for solving efficiently and effectively large-scale computational and optimization problems. This method was originally invented for solving elliptic partial differential equations and up to now it represents the most effective class of numerical algorithms for them. During the last two decades, there were many successful attempts to ad...
متن کامل